Computability over The Partial Continuous Functionals
نویسنده
چکیده
We show that to every recursive total continuous functional Φ there is a representative Ψ of Φ in the hierearchy of partial continuous functionals such that Ψ is S1 − S9 computable over the hierarchy of partial continuous functionals. Equivalently, the representative Ψ will be PCF -definable over the partial continuous functionals, where PCF is Plotkin’s programming language for computable functionals.
منابع مشابه
Recursion on the partial continuous functionals
We describe a constructive theory of computable functionals, based on the partial continuous functionals as their intendend domain. Such a task had long ago been started by Dana Scott [28], under the well-known abbreviation LCF. However, the prime example of such a theory, Per Martin-Löf’s type theory [24] in its present form deals with total (structural recursive) functionals only. An early at...
متن کاملRepresentation theorems for transfinite computability and definability
The continuous functionals were independently introduced by Kleene [6] and Kreisel [7]. Kleenes motivation was to isolate a subclass of the total functionals of pure, finite type closed under S1-S9-computations (Kleene [5]) which could be described using countable information. He defined his functionals via the associates and the idea is that an associate for a functional Ψ contains sufficient ...
متن کاملA Construction of Typed Lambda Models Related to Feasible Computability
In this paper we develop an approach to the notion of computable functionals in a very abstract setting not restricted to Turing or, say, polynomial computability. We assume to start from some basic class of domains and a basic class of functions deened on these domains. (An example may be natural numbers with polytime computable functions). Then we deene what are \all" corresponding functional...
متن کاملTowards a Formal Theory of Computability
We sketch a constructive formal theory TCF of computable functionals, based on the partial continuous functionals as their intendend domain. Such a task had long ago been started by Dana Scott [12, 15], under the wellknown abbreviation LCF (logic of computable functionals). The present approach differs from Scott’s in two aspects. (i) The intended semantical domains for the base types are non-f...
متن کاملRecent Advances in S-Definability over Continuous Data Types
The purpose of this paper is to survey our recent research in computability and definability over continuous data types such as the real numbers, real-valued functions and functionals. We investigate the expressive power and algorithmic properties of the language of Σ-formulas intended to represent computability over the real numbers. In order to adequately represent computability we extend the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Log.
دوره 65 شماره
صفحات -
تاریخ انتشار 2000